Supramolecularly engineered phospholipids constructed by nucleobase molecular recognition: upgraded generation of phospholipids for drug delivery

Despite of great advances of phospholipids and liposomes in clinical therapy, very limited success has been achieved in the preparation of smart phospholipids and controlled-release liposomes for in vivo drug delivery and clinical trials. Here we report a supramolecular approach to synthesize novel supramolecularly engineered phospholipids based on complementary hydrogen bonding of nucleosides, which greatly reduces the need of tedious chemical synthesis, including reducing the strict requirements for multistep chemical reactions, and the purification of the intermediates and the amount of waste generated relative more traditional approaches. These upgraded phospholipids self-assemble into liposome-like bilayer structures in aqueous solution, exhibiting fast stimuli-responsive ability due to the hydrogen bonding connection. In vitro and in vivo evaluations show the resulted supramolecular liposomes from nucleoside phospholipids could effectively transport drug into tumor tissue, rapidly enter tumor cells, and controllably release their payload in response to an intracellular acidic environment, thus resulting in a much higher antitumor activity than conventional liposomes. The present supramolecularly engineered phospholipids represent an important evolution in comparison to conventional covalent-bonded phospholipid systems.     

Hamiltonicity of edge chromatic critical graphs

Vizing conjectured that every edge chromatic critical graph contains a 2-factor. Believing that stronger properties hold for this class of graphs, Luo and Zhao (2013) showed that every edge chromatic critical graph of order $n$ with maximum degree at least $\frac{6n}{7}$ is Hamiltonian. Furthermore, Luo et al. (2016) proved that every edge chromatic critical graph of order $n$ with maximum degree at least $\frac{4n}{5}$ is Hamiltonian. In this paper, we prove that every edge chromatic critical graph of order $n$ with maximum degree at least $\frac{3n}{4}$ is Hamiltonian. Our approach is inspired by the recent development of Kierstead path and Tashkinov tree techniques for multigraphs.     

TV‐like regularization for backward parabolic problems

This paper investigates an inverse problem for parabolic equations backward in time, which is solved by total‐variation‐like (TV‐like, in abbreviation) regularization method with cost function ∥u_x∥². The existence, uniqueness and stability estimate for the regularization problem are deduced in the linear case. For numerical illustration, the variational adjoint method, which presents a simple method to derive the gradient of the optimization functional, is introduced to reconstruct the unknown initial condition for both linear and nonlinear parabolic equations. The conjugate gradient method is used to iteratively search for the optimal approximation. Numerical results validate the feasibility and effectiveness of the proposed algorithm. Copyright © 2016 John Wiley & Sons, Ltd.     

Exact boundary controllability for 1‐D quasilinear wave equations with dynamical boundary conditions

By equivalently replacing the dynamical boundary condition by a kind of nonlocal boundary conditions, and noting a hidden regularity of solution on the boundary with a dynamical boundary condition, a constructive method with modular structure is used to get the local exact boundary controllability for 1‐D quasilinear wave equations with dynamical boundary conditions. Copyright © 2016 John Wiley & Sons, Ltd.     

Textile porosity determination based on a nonlinear heat and moisture transfer model

The inverse problems of textile materials design on heat and moisture transfer properties are important and indispensable in applications in the body-clothing-environment system. We present an inverse problem of textile porosity determination (IPTPD) based on a nonlinear heat and moisture transfer model. Adopting the idea of the least-squares, the mathematical formulation of IPTPD is deduced to a regularized optimization problem with collocation method applied. The continuity of the regularized minimization problem is proved. By means of genetic algorithm (GA), the approximate solution of the IPTPD is numerically obtained. To reduce the computational cost, an improved algorithm based on BP neural network with GA is proposed in the numerical simulation. Compared with the direct GA searching, the computational cost is greatly reduced, which presents a similar result.     

Study on anti-UV aging mechanism of PP-<Emphasis Type="Italic">g</Emphasis>-AN in the PP/PP-<Emphasis Type="Italic">g</Emphasis>-AN blend

In order to verify the anti-UV aging mechanism about polypropylene-grafting-acrylonitrile (PP-g-AN) to polypropylene (PP), the structural analysis of the PP/PP-g-AN blend before and after aging was carried out via the X-ray photoelectron spectroscopy (XPS), Fourier Transform Infrared Spectrometry (FTIR) and UV-visible Absorbance Spectrum (UV–Vis). Inference on PP-g-AN anti-aging process was proposed and confirmed.     

非单C~*-代数α-比较性的等价刻画

给出非单C~*-代数α-比较性的等价刻画:当每个τ∈QT(■H)均为忠实时,■具有α-比较性,当且仅当对于任意的〈a〉,〈b〉∈Cu(■)且∝,若α·d_τ(a)≤在Cu(■)中成立;一般地,当QT(■H)≠Φ时,■具有α-比较性,当且仅当对于任意的,∈Cu(■),若存在η>0,使得d_τ(α)≤(α~(-1)-η)d_τ(b)(_τ∈QT(■H)),则≤在Cu(■)中成立.     

Evaluation of the Hamming weights of a class of linear codes based on Gauss sums

Linear codes with a few weights have been widely investigated in recent years. In this paper, we mainly use Gauss sums to represent the Hamming weights of a class of q-ary linear codes under some certain conditions, where q is a power of a prime. The lower bound of its minimum Hamming distance is obtained. In some special cases, we evaluate the weight distributions of the linear codes by semi-primitive Gauss sums and obtain some one-weight, two-weight linear codes. It is quite interesting that we find new optimal codes achieving some bounds on linear codes. The linear codes in this paper can be used in secret sharing schemes, authentication codes and data storage systems.     

On the criterion vectors of lines of portfolio selection with multiple quadratic and multiple linear objectives

As the research for portfolio selection evolves, traditional models and models with one quadratic objective and multiple linear objectives are being solved. In this paper, I propose models with multiple quadratic and multiple linear objectives. Due to the difficulty involved, I study the new models by lines in decision space, analyze the criterion vectors of the lines by projection, and approximate the nondominated sets by the criterion vectors. As an illustration, I extend Merton’s portfolio selection model, propose algorithms to approximate the nondominated sets by the criterion vectors of portfolios with cardinality 3 and then K, and demonstrate the number of the criterion vectors.     

凝胶渗透色谱-气相色谱-离子阱质谱法测定桔梗原药和当归提取物中101种农药残留

建立了凝胶渗透色谱（GPC）-气相色谱-离子阱质谱同时检测桔梗原药和当归提取物中101种农药残留的分析方法。方法采用乙腈超声辅助提取桔梗原药和当归提取物,浓缩提取液至近干后用乙酸乙酯-环己烷（1∶1, v/v）复溶,采用凝胶渗透色谱法（选取40 cm长、内径20 mm的凝胶渗透色谱柱）对样品进行净化,弃去前段含脂类、色素等杂质的流出液,收集17~30 min洗脱液并旋转蒸发浓缩至近干,甲苯1 mL定容上机。选用DB-5MS毛细管色谱柱分离待测物,通过离子阱质谱实现对101种农药残留的高效检测。方法通过优化前处理条件和离子阱二级质谱参数,有效降低了复杂中药基质对待测化合物的干扰,最大限度提高了样品中农药的定量准确性和回收率,101种农药3水平添加的平均回收率为58.3%~108.9%,每个添加水平10次独立重复测定的相对标准偏差为0.4%~16.5%,检出限（LOD）范围为0.2~40.0 μg/kg,可满足当前韩国、日本、欧洲规定的最大残留限量（maximum residue limits, MRLs）要求。方法具有操作简单快速、灵敏度高、重复性好等特点,凝胶渗透色谱技术的应用克服了固相萃取小柱净化容量不足的弊端,离子阱技术的应用可以进一步排除共流出基体杂质的干扰,提高定量和定性的准确性,检测效果优于常用的气相色谱-质谱法,是对中药中同时分析多种农药残留检测方法的有益补充。